K−insertion and k−deletion closure of languages
نویسندگان
چکیده
The operation of k−insertion (k−deletion) is a generalization of the catenation (quotient) of words and languages. The k−insertion of w into u = u1u2 consists of all words u1wu2 where the length of u2 is at most k (k−deletion is performed in a analogous fashion). To a language L we associate the set k−ins(L) (k−del(L)) consisting of words with the following property: their k−insertion into (k−deletion from) any word of L yields words which also belong to L. We study properties of these languages and of languages which are k−insertion (k−deletion) closed. Mathematics Subject Classification. Primary 68Q45; Secondary 20M35. This research was supported by Grant OGP0007877 of the Natural Sciences and Engineering Research Council of Canada All correspondence to Lila Kari.
منابع مشابه
Insertion and Deletion for Involution Codes
This paper introduces a generalization of the operation of catenation: u[k]lv, the left-k-insertion, is the set of all words obtained by inserting v into u in positions that are at most k letters away from the left extremity of the word u. We define k-suffix codes using the left-kinsertion operation and extend the concept of k-prefix and k-suffix codes to involution k-prefix and involution k-su...
متن کاملBlock insertion and deletion on trajectories
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel syntactical constraint provided by trajectories, these operations properly generalize several sequential as well as parallel binary language operations such as catenation, sequential insertion, k-insertion, parallel inserti...
متن کاملPower of controlled insertion and deletion.dvi
The paper investigates classes of languages obtained as the closure of certain atomic languages under some insertion and deletion operations. Each of the classes studied is closed under an insertion operation, a deletion operation and an iterative insertion one. The operations are controlled and have been chosen as stated in order to allow an increase as well as a decrease of the length of the ...
متن کاملInsertion and Deletion Closure of Languages
To a given language L, we associate the sets ins(L) (resp. &l(L)) consisting of words with the following property: their insertion into (deletion from) any word of L yields words which also belong to L. Properties of these sets and of languages which are insertion (deletion) closed are obtained. Of special interest is the case when the language is ins-closed (del-closed) and finitely generated....
متن کاملUndecidability of finite convergence for concatenation, insertion and bounded shuffle operators
The k-insertion and shuffle operations on formal languages have been extensively studied in the computer science and control systems literature. These operations can be viewed as purely abstract, as representations of biological processes or as models of the interleavings of concurrent processes. Questions naturally arise about closure and decidability. Many have been previously answered, espec...
متن کامل